A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization
نویسندگان
چکیده
منابع مشابه
A Class of New Large-Update Primal-Dual Interior-Point Algorithms for Linear Complementarity Problems
In this paper we propose a class of new large-update primal-dual interior-point algorithms for P∗(κ) nonlinear complementarity problem (NCP), which are based on a class of kernel functions investigated by Bai et al. in their recent work for linear optimization (LO). The arguments for the algorithms are followed as Peng et al.’s for P∗(κ) complementarity problem based on the self-regular functio...
متن کاملPrimal-dual entropy-based interior-point algorithms for linear optimization
We propose a family of search directions based on primal-dual entropy in the contextof interior-point methods for linear optimization. We show that by using entropy based searchdirections in the predictor step of a predictor-corrector algorithm together with a homogeneousself-dual embedding, we can achieve the current best iteration complexity bound for linear opti-mization. The...
متن کاملA New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
We introduce a new barrier function which is not a barrier function in the usual sense: it has finite value at the boundary of the feasible region. Despite this, its iteration bound, O (√ n logn log n ε ) , is as good as it can be: it is the best known bound for large-update methods. The recently introduced notions of superconvexity and exponential convexity are crucial in the analysis.
متن کاملA Primal-Dual Large-update Interior-point Algorithm for Semi-definite Optimization Based on a New Parametric Kernel Function
Based on a new parametric kernel function, this paper presents a primaldual large-update interior-point algorithm (IPM) for semi-definite optimization (SDO) problems. The new parametric function is neither self-regular function nor the usual logarithmic barrier function. It is strongly convex and possesses some novel analytic properties. We analyse this new parametric kernel function and show t...
متن کاملA Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
Recently, so-called self-regular barrier functions for primal-dual interior-point methods (IPMs) for linear optimization were introduced. Each such barrier function is determined by its (univariate) self-regular kernel function. We introduce a new class of kernel functions. The class is defined by some simple conditions on the kernel function and its derivatives. These properties enable us to d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2008
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-008-9389-z